Given a non-empty array nums containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.

Input: nums = [1,5,11,5] Output: true Explanation: The array can be partitioned as [1, 5, 5] and [11]. 

Input: nums = [1,2,3,5] Output: false Explanation: The array cannot be partitioned into equal sum subsets. 

• 1 <= nums.length <= 200
• 1 <= nums[i] <= 100

# @param {Integer[]} nums# @return {Boolean}defcan_partition(nums)sum=nums.sumtarget=sum / 2returnfalseifsum.odd? || nums.any?{ |x| x > target}dp=[false] * (target + 1)dp[0]=truenums.each{ |x| (0..target - x).reverse_each{ |i| dp[i + x] |= dp[i]}}dp[target]end

implSolution{pubfncan_partition(nums:Vec<i32>) -> bool{let sum = nums.iter().sum::<i32>()asusize;let target = sum / 2;if sum % 2 == 1 || nums.iter().any(|&x| x asusize > target){returnfalse;}letmut dp = vec![false; target + 1]; dp[0] = true;for x in nums {for i in(0..=target - x asusize).rev(){ dp[i + x asusize] |= dp[i];}} dp[target]}}